Online Resource Allocation Problems∗

نویسندگان

  • Patrick Jaillet
  • Xin Lu
چکیده

In this paper, we consider an online resource allocation problem, where buyers with limited budgets are interested in purchasing items that consume a limited amount of resources. In general, there is no nontrivial performance guarantee for the worst cases. However, after imposing two reasonable restrictions, we can propose two online algorithms, a greedy algorithm and a primal dual algorithm, with non-trivial performance guarantees. We further show that these two algorithms are asymptotically the best among all algorithms, either deterministic or randomized, in terms of competitive ratios.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Online Resource Allocation with Structured Diversification

A variety of modern data analysis problems, ranging from finance to job scheduling, can be considered as online resource allocation (ORA) problems. A key consideration in such ORA problems is some notion of risk, and suitable ways to alleviate risk. In several settings, the risk is structured so that groups of assets, such as stocks, are exposed to similar risks. In this paper, we present a for...

متن کامل

Ordinal Optimization for a Class of Deterministic and Stochastic Discrete Resource Allocation Problems

The authors consider a class of discrete resource allocation problems which are hard due to the combinatorial explosion of the feasible allocation search space. In addition, if no closed-form expressions are available for the cost function of interest, one needs to evaluate or (for stochastic environments) estimate the cost function through direct online observation or through simulation. For t...

متن کامل

Measurement-based Efficient Resource Allocation with Demand-Side Adjustments

The problem of efficient resource allocation has drawn significant attention in many scientific disciplines due to its direct societal benefits, such as energy savings. Traditional approaches in addressing online resource allocation problems neglect the potential benefit of feedback information available from the running tasks/loads as well as the potential flexibility of a task to adjust its o...

متن کامل

Near-Optimal Online Algorithms for Dynamic Resource Allocation Problems

In this paper, we study a general online linear programming problem whose formulation encompasses many practical dynamic resource allocation problems, including internet advertising display applications, revenue management, various routing, packing, and auction problems. We propose a model, which under mild assumptions, allows us to design near-optimal learning-based online algorithms that do n...

متن کامل

Combining Benders and Dantzig-Wolfe Decompositions for Online Stochastic Combinatorial Optimization

Online resource allocation problems are difficult because the operator must make irrevocable decisions rapidly and with limited (or nonexistent) information on future requests. We propose a mathematical-programming-based framework that takes into account all the available forecasts and the limited computational time. We combine Benders decomposition, which allows us to measure the expected futu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011